Lossless Compression of Binary Trees With Correlated Vertex Names
نویسندگان
چکیده
منابع مشابه
cient Lossless Compression of Trees and Graphs
In this paper, we study the problem of compressing a data structure (e.g. tree, undirected and directed graphs) in an eecient way while keeping a similar structure in the compressed form. To date, there has been no proven optimal algorithm for this problem. We use the idea of building LZW tree in LZW compression to compress a binary tree generated by a stationary ergodic source in an optimal ma...
متن کاملEfficient Lossless Compression of Trees and Graphs
Data compression algorithms have been widely used in many areas to meet the demand of storage and transfer of large size data. Most of the data compression algorithms regard the input as a sequence of binary numbers and represent the compressed data also as a binary sequence. However, in many areas such as programming languages (e.g. LISP and C) and compiler design, it is more desirable to have...
متن کاملHybrid Lossless Compression Method for Binary Images
In this paper, we propose a lossless compression scheme for binary images which consists of a novel encoding algorithm which uses a new edge tracking algorithm. The proposed compression scheme has two sub-stages: (i) encoding binary image data using the proposed encoding method (ii) compression the encoded image data using any well-known image compression method such as Huffman, Run-Length or L...
متن کاملLossless image compression using binary wavelet transform
A binary wavelet transform (BWT) has several distinct advantages over a real wavelet transform when applied to binary data. No quantisation distortion is introduced and the transform is completely invertible. Since all the operations involved are modulo-2 arithmetic, it is extremely fast. The outstanding qualities of the BWT make it suitable for binary image-processing applications. The BWT, or...
متن کاملLossless compression of large binary images in digital spatial libraries
A method for lossless compression of large binary images is proposed for applications where spatial access to the image is needed. The method utilizes the advantages of (1) variable-size context modeling in a form of context trees, and (2) forward-adaptive statistical compression. New strategies for constructing the context tree are introduced, including a fast two-stage bottom-up approach. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2851224